/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
ll n;
const ll mod = 1e9 + 7;

int main()
{
    IOS;
    cin >> n;
    if (n == 1)
    {
        cout << 1 << endl;
        return 0;
    }
    if (n & 1)
        n--;
    if (n == 2)
    {
        cout << 2 << endl;
        return 0;
    }
    ll ad = 2, ans = 2, add = 0;
    ll cnt = 0;
    for (ll i = 4; i <= n; i += 2)
    {
        ans = (ans + ad) % mod;
        cnt++;
        if (cnt == 2)
        {
            add = (add + 2) % mod;
            ad = (ad + add) % mod;
            cnt = 0;
        }
    }
    cout << ans << endl;
    getchar();
    getchar();
    return 0;
}
